Symmetric Duality for Mathematical Programming in Complex Spaces with Second Order F-univexity
نویسندگان
چکیده
Bector et al., (1994) introduced the concept of univexity. Mishra (1998), Mishra and Reuda (2001) and Mishra et al., (2005) have applied and generalized these functions. Mathematical programming in complex spaces originated from Levinson’s discussion of linear problems (Levinson, 1966). Mishra and Reuda (2003) have generalized these upto first orders, second order with symmetric duality. Further Mishra and Rueda (2003) have given second order generalized invexity and it’s duality theorems in multiobjective programming problems. For more details reader may consult (Ferraro, 1992; Lai, 2000; Liu, 1997; Liu et al., 1997). Symmetric duality in real mathematical programming was introduced by Dorn (1961), who defined a program and its dual to be symmetric if the dual of the dual is original problem. Later, Mond and W eir (1981) presented a pair of symmetric dual nonlinear programs which allows the weakening of the convexity-concavity condition. For more work on symmetric duality in real spaces (Chandra et al., 1998; Gulati and A hmad, 1997; Mishra, 2000a; Mishra, 2000b). Mangasarian (1975) considered a nonlinear program and discussed second order duality under certain inequalities. Mond (1974) assumed simple inequalities respectively and indicated a possible computational advantage of the second order dual over the first order dual. Bector and Chandra (1987) defined the functions satisfying these inequalities (Mond, 1974) to be bonvex/boncave. Mishra (2000a) obtained second order duality results for a pair of Wolfe and Mon-Weir type second order symmetric dual nonlinear programming problems in real spaces under second order F-convexity, F-concavity and second order F-convexity is an extension of F-convex functions introduced by Hanson and Mond (1982). Mishra (2000b) formulated a pair of multiobjective second order symmetric dual programs for arbitrary cones in real space. The model considered in (Mishra, 2000b) unifies the Wolfe and the M ond-Weir type second order vector symmetric dual models. Gupta (1983) formulated a second order nonlinear symmetric dual program on the pattern of second order dual formulation as given by Mangasarian (1975) for the real case, but the constraints in the formulation (Gupta, 1983) is linear. Lai (2000) extended the concept of F-convex functions to the complex case and established sufficient optimality and duality theorems for a pair of nondifferentiable fractional complex programs. In this study, we defined F-univex in the complex space in two variables. Hence extend the concepts of F-pseudounivex, F-pseudounicave functions and study symmetric duality under the aforesaid assumptions for Wolfe and Mond-Weir type models with second order in complex spaces.
منابع مشابه
Mond-Weir type second order multiobjective mixed symmetric duality with square root term under generalized univex function
In this paper, a new class of second order ( , ) -univex and second order ( , ) pseudo univex function are introduced with example. A pair Mond-Weir type second order mixed symmetric duality for multiobjective nondifferentiable programming is formulated and the duality results are established under the mild assumption of second order ( , ) univexity and second order pseudo univexity...
متن کاملSecond - Order Duality for Nondifferentiable Multiobjective Programming Involving ( , Ρ ) - Univexity
The concepts of ( , ρ)-invexity have been given by Carsiti,Ferrara and Stefanescu[32]. We consider a second-order dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under appropriate second-order ( , ρ)-univexity conditions. AMS 2002 Subject Classification: 90C29, 90C30, 90C46.
متن کاملSufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کاملNon-differentiable second order symmetric duality in mathematical programming with F-convexity
A pair of Wolfe type non-differentiable second order symmetric primal and dual problems in mathematical programming is formulated. The weak and strong duality theorems are then established under second order F-convexity assumptions. Symmetric minimax mixed integer primal and dual problems are also investigated. 2002 Elsevier Science B.V. All rights reserved.
متن کاملSecond Order Duality in Multiobjective Fractional Programming with Square Root Term under Generalized Univex Function
Three approaches of second order mixed type duality are introduced for a nondifferentiable multiobjective fractional programming problem in which the numerator and denominator of objective function contain square root of positive semidefinite quadratic form. Also, the necessary and sufficient conditions of efficient solution for fractional programming are established and a parameterization tech...
متن کامل